A general analytical model of adaptive wormhole routing in k-ary n-cubes

Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern. Although,hypercube is a special case of k-ary n-cubes topology, the modeling approach for hypercube is more accurate than karyn-cubes due to its simpler structure. This paper proposes a general analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing that uses a similar modeling approach to hypercube. The analysis focuses Duato's fully adaptive routing algorithm [12], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general enough that it can be used for hypercube and other fully adaptive routing algorithms

Rate-Privacy in Wireless Sensor Networks

This paper introduces the concept of rate privacy in the context of wireless sensor networks. Our discussion reveals that the concept indeed is of a great importance for the privacy preservation of such networks. As a result, we propose a buffering scheme to protect the rate from adversaries. Simulation results verify the applicability of our approach

The impacts of timing constraints on virtual channels multiplexing in interconnect networks

Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, multicomputer systems and system area networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions

Performance modeling of fault-tolerant circuit-switched communication networks

Circuit switching (CS) has been suggested as an efficient switching method for supporting simultaneous communications (such as data, voice, and images) across parallel systems due to its ability to preserve both communication performance and fault-tolerant demands in such systems. In this paper we present an efficient scheme to capture the mean message latency in 2D torus with CS in the presence of faulty components. We have also conducted extensive simulation experiments, the results of which are used to validate the analytical mode

On quantifying fault patterns of the mesh interconnect networks

One of the key issues in the design of Multiprocessors System-on-Chip (MP-SoCs), multicomputers, and peerto- peer networks is the development of an efficient communication network to provide high throughput and low latency and its ability to survive beyond the failure of individual components. Generally, the faulty components may be coalesced into fault regions, which are classified into convex and concave shapes. In this paper, we propose a mathematical solution for counting the number of common fault patterns in a 2-D mesh interconnect network including both convex (|-shape, | |-shape, ý-shape) and concave (L-shape, Ushape, T-shape, +-shape, H-shape) regions. The results presented in this paper which have been validated through simulation experiments can play a key role when studying, particularly, the performance analysis of fault-tolerant routing algorithms and measure of a network fault-tolerance expressed as the probability of a disconnection

Software-based fault-tolerant routing algorithm in multidimensional networks

Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The software-based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks (Suh et al., 2000). Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments

A Low-complexity trajectory privacy preservation approach for indoor fingerprinting positioning systems

Location fingerprinting is a technique employed when Global Positioning System (GPS) positioning breaks down within indoor environments. Since Location Service Providers (LSPs) would implicitly have access to such information, preserving user privacy has become a challenging issue in location estimation systems. This paper proposes a low-complexity k-anonymity approach for preserving the privacy of user location and trajectory, in which real location/trajectory data is hidden within k fake locations/trajectories held by the LSP, without degrading overall localization accuracy. To this end, three novel location privacy preserving methods and a trajectory privacy preserving algorithm are outlined. The fake trajectories are generated so as to exhibit characteristics of the user’s real trajectory. In the proposed method, no initial knowledge of the environment or location of the Access Points (APs) is required in order for the user to generate the fake location/trajectory. Moreover, the LSP is able to preserve privacy of the fingerprinting database from the users. The proposed approaches are evaluated in both simulation and experimental testing, with the proposed methods outperforming other well-known k-anonymity methods. The method further exhibits a lower implementation complexity and higher movement similarity (of up to 88%) between the real and fake trajectories

Blockchain-based privacy-preserving healthcare architecture

Since the introduction of Internet of Things (IoT), e-health has become one of the main research topics.Due to the sensitivity of patient data,preserving the privacy of patientsappears to be challenging. In healthcare applications, patient data are usually stored in the cloud, which makes it difficult for the users to have enough control over their data. However, due to the General Data Protection Regulation (GDPR), it is the data subject’s right to know where and how hisdata has been stored, who can access hisdata and to what extent. In this paper, we propose a blockchain-based architecture for e-health applications whichprovides an efficient privacy-preserving access control mechanism. We take advantage of Blockchain(BC)special features, i.e., immutability and anonymity of users,whilemodifyingthe classic blockchain structure in order to overcome its challenges in IoT applications(i.e., low throughput, high overhead and latency). To this end, we cluster the miners of BC, store and process data at the nearest clusterto the patient. While our proposal is a work in progress, we provide a security analysis of our proposed architecture

An analytical model of pipelined circuit switching in hypercubes in the presence of hot spot traffic

Several recent studies have revealed that PCS can provide superior performance characteristics over wormhole switching under uniform traffic. Analytical model of PCS for common networks (e.g., hypercube) under uniform traffic pattern have recently been reported in the literature. In this paper we propose an analytical model of PCS in the hypercube network augmented with virtual channel in the presence of hot spot traffic. The model has a good agreement with simulation experiments

PHYTOTHERAPY IN FUNGI AND FUNGAL DISEASE: A REVIEW OF EFFECTIVE MEDICINAL PLANTS ON IMPORTANT FUNGAL STRAINS AND DISEASES

Infectious diseases are among the most important common diseases worldwide that bring stupendous costs for human community. Medicinal plants are considered a rich source of antimicrobial agents and therefore can be used as antimicrobial remedies because of producing secondary metabolites. This article was designed to review the effective medicinal plants on fungi and fungal disease. In this study, the relevant articles published in Persian and English languages were searched for in the databases Magiran, Iranmedex, Irandoc, PubMed, Scopus, SID, Web of Science, and Science Direct using the search engine Google Scholar. To maximize the comprehensiveness of the search, the general terms antimicrobial, dermatophyte, mycotic, Iran, and anti-Candida as well as their Persian equivalents were used. AND and OR were used for combining searches. Medicinal herbs such as Zataria multiflora, Thymus vulgaris, Thymus kotschyanus, Punicagranatum L., Rosmarinus officinalis L., Matricaria chamomilla L., Urtica dioica L., Mentha piperita L. and Salvia officinalis L., Thymus vulgaris, Salvia officinalis, Eucalyptus globulus, Myentha piperita, Oliveria decumbens, Echinophora Platyloba, Thymus eriocalyx and Thymus X-porlock, Achillea millefolium, Artemisia sieberi, Cuminum cyminum, Nigella sativa, Heracleum persicum, Hyssopus officinalis, Matricaria recutital, Menta spicata, Foeniculum vulgare, Pimpinella anisum, Plargonium graveolens, Rosmarinus officinalis, Saturia hortensis, Zataria multiflora, Thymus kotschyanus, Zataria multiflora, Ziziphora clinopodioides, Mentha piperita L., Physalis alkekengi L., Hymenocrater longiflorus Benth and are the most important Medicinal herbs effective on fungal diseases. Medicinal herbs mentioned in this study due to phenolic compounds and antioxidant activities have antifungal effects